Logic Program Synthesis from Incomplete Specifications

نویسندگان

  • Pierre Flener
  • Yves Deville
چکیده

Program synthesis research aims at maximally automating the passage from specifications to programs (see the survey by Biermann, 1992). We define possible formalisms for the starting points (specifications: see Section 1.1) and results (programs: see Section 1.2) of synthesis, and state existing approaches and related work, before pinning down the objectives (Section 1.3) of this paper. Some familiarity with logic programming is assumed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SYNAPSE- A System for Logic Program Synthesis from Incomplete Specifications

A logic program development methodology has been proposed by the second author [3]. It aims at programming-in-the-small, and is (mainly) meant for “algorithmic” problems. It starts from a complete, yet informal, specification of the target problem. A crucial step is the design of the logic of the program, based solely on the declarative semantics of logic, and with exclusive concern about corre...

متن کامل

Inductive Synthesis of Recursive Logic Programs: Achievements and Prospects

The inductive synthesis of recursive logic programs from incomplete information, such as input/output examples, is a challenging subfield both of ILP (Inductive Logic Programming) and of the synthesis (in general) of logic programs from formal specifications. We first overview past and present achievements, focusing on the techniques that were designed specifically for the inductive synthesis o...

متن کامل

Synthesis from Knowledge-Based Specifications

In program synthesis, we transform a specification into a program that is guaranteed to satisfy the specification. In synthesis of reactive systems, the environment in which the program operates may behave nondeterministically, e.g., by generating different sequences of inputs in different runs of the system. To satisfy the specification, the program needs to act so that the specification holds...

متن کامل

Synthesizing Strategies for Epistemic Goals by Epistemic Model Checking: An Application to Pursuit Evasion Games

The paper identifies a special case in which the complex problem of synthesis from specifications in temporal-epistemic logic can be reduced to the simpler problem of model checking such specifications. An application is given of strategy synthesis in pursuit-evasion games, where one or more pursuers with incomplete information aim to discover the existence of an evader. Experimental results ar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 15  شماره 

صفحات  -

تاریخ انتشار 1993